Degrees and formal degrees for division algebras and GLnover ap-adic field

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix Units and Generic Degrees for the Ariki–koike Algebras

The cyclotomic Hecke algebras were introduced by Ariki and Koike [2,4] and Broué and Malle [7]. It is conjectured [7] that these algebras play a rôle in the representation theory of reductive groups similar to (but more complicated than) that played by the Iwahori–Hecke algebras (see, for example, [8]). In particular, it should be possible to use these algebras to compute the degrees (and more ...

متن کامل

Generic Degrees of Ariki–koike Algebras

This note describes how to compute the generic degrees of the Ariki–Koike algebras by first constructing a basis of matrix units inside the algebras. As a consequence, we are able to define an explicit isomorphism from any semisimple Ariki–Koike algebra to the group algebra of the corresponding complex reflection group. This article is based fairly closely on the talk that I gave in Osaka at th...

متن کامل

On the Generic Degrees of Cyclotomic Algebras

We determine the generic degrees of cyclotomic Hecke algebras attached to exceptional finite complex reflection groups. The results are used to introduce the notion of spetsial reflection group, which in a certain sense is a generalization of the finite Weyl group. In particular, to spetsial W there is attached a set of unipotent degrees which in the case of a Weyl group is just the set of degr...

متن کامل

I classes, LR degrees and Turing degrees

We say that A ≤LR B if every B-random set is A-random with respect to Martin-Löf randomness. We study this reducibility and its interactions with the Turing reducibility, Π1 classes, hyperimmunity and other recursion theoretic notions. A natural variant of the Turing reducibility from the point of view of Martin-Löf randomness is the LR reducibility which was introduced in [12]. We say that A ≤...

متن کامل

Degrees of Efficiency and Degrees of Minimality

In this work we characterize different types of solutions of a vector optimization problem by means of a scalarization procedure. Usually different scalarizing functions are used in order to obtain the various solutions of the vector problem. Here we consider different kinds of solutions of the same scalarized problem. Our results allow us to establish a parallelism between the solutions of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1990

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1990.141.21